What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes
نویسندگان
چکیده
This paper provides an empirical test of a hypothesis, which describes the effects of structural mechanisms in genetic programming. In doing so, the paper offers a test problem anticipated by this hypothesis. The problem is tunably difficult, but has this property because tuning is accomplished through changes in structure. Content is not involved in tuning. The results support a prediction of the hypothesis – that GP search space is significantly constrained as an outcome of structural mechanisms.
منابع مشابه
سیگار، دروازه ورود به اعتیاد
Smoking and cigarettes permanent consumption caused by common misbelieve in society. The aim of this study is that what are the effects of smoking on the tendency of people to drug abuse? "Gateway hypothesis" is one of the theories about addiction and drug use. According to this hypothesis, the use of drugs, is started with legal drug abuse and is developed to "hard drug". Review of the documen...
متن کاملValidating an English Language Teacher Professional Development Scale in Iranian EFL Context
Although decades of research have well elaborated on teacher professional development, we still do not have a thorough picture about what teacher professional development could entail and what components it consists of. The present study aims to develop and validate a teacher professional development scale in an Iranian English foreign language context. An initial tentative model with 130 items...
متن کاملSample Latex File Showing References
For this style citations are listed alphabetically, but are cited in the text using name and year format. (2001). What makes a problem gp-hard? analysis of tunably difficult problems in genetic programming. the influence of depth and degree of genotypic change on fitness in genetic programming.
متن کاملA modified elite ACO based avoiding premature convergence for travelling salesmen problem
The Travelling Salesmen Problem (TSP) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. In this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. Solving this problem seems hard because program statement is simple and leads this problem belonging to NP...
متن کاملSolving the Traveling Salesman Problem by an Efficient Hybrid Metaheuristic Algorithm
The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...
متن کامل